Extensions of rooted trees and their applications
نویسندگان
چکیده
منابع مشابه
4-PLACEMENT OF ROOTED TREES
A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.
متن کاملextensions, minimality and idempotents of certain semigroup compactifications
در فصل اول مقدمات و پیش نیازهای لازم برای فصل های بعدی فراهم گردیده است . در فصل دوم مساله توسیع مورد توجه قرار گرفته و ابتدا شرایطی که تحت آن از یک فشرده سازی نیم گروهی خاص یک زیرگروه نرمال بسته یک گروه به یک فشرده سازی متناظر با فشرده سازی اولیه برای گروه رسید مورد بررسی قرار گرفته و سپس ارتیاط بین ساختارهای مختلف روی این دو فشرده سازی از جمله ایده آل های مینیمال چپ و راست و... مورد بررسی قرا...
15 صفحه اولA-trees and Their Applications
To most mathematicians and computer scientists the word "tree" conjures up, in addition to the usual image, the image of a connected graph with no circuits. We shall deal with various aspects and generalizations of these mathematical trees. (As Peter Shalen has pointed out, there will be leaves and foliations in this discussion, but they do not belong to the trees!) In the last few years variou...
متن کاملΛ-trees and Their Applications
To most mathematicians and computer scientists the word " tree " conjures up, in addition to the usual image, the image of a connected graph with no circuits. We shall deal with various aspects and generalizations of these mathematical trees. (As Peter Shalen has pointed out, there will be leaves and foliations in this discussion, but they do not belong to the trees!) In the last few years vari...
متن کاملCounting Rooted Trees
Combinatorial classes T that are recursively defined using combinations of the standard multiset, sequence, directed cycle and cycle constructions, and their restrictions, have generating series T(z) with a positive radius of convergence; for most of these a simple test can be used to quickly show that the form of the asymptotics is the same as that for the class of rooted trees: C · ρ−n · n−3/...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1977
ISSN: 0012-365X
DOI: 10.1016/0012-365x(77)90074-7